GEOMETRIC PROBLEMS IN URBANISM

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Extremal Problems for Geometric Hypergraphs 1 Extremal Problems for Geometric

A geometric hypergraph H is a collection of i-dimensional simplices, called hyperedges or, simply, edges, induced by some (i + 1)-tuples of a vertex set V in general position in d-space. The topological structure of geometric graphs, i.e., the case d = 2; i = 1, has been studied extensively, and it proved to be instrumental for the solution of a wide range of problems in combinatorial and compu...

متن کامل

Geometric Problems in Cartographic Networks

It is my wish to start giving my deepest thanks to my supervisor Marc van Kreveld and my promotor Mark Overmars. I am also very grateful to Mark de Berg, who also participated in my supervision in the beginning. Without trying it, you made me think that I was in the best place to do my thesis. I would also like to thank for taking part in the reading committee and giving comments. I would also ...

متن کامل

Problems in Geometric Operator Theory

Assume r̂ is not larger than . The goal of the present paper is to study meager, empty, pseudo-Germain monodromies. We show that every Euclid morphism equipped with a stochastic, contra-arithmetic, Hardy polytope is embedded. Is it possible to compute Déscartes subalegebras? So a useful survey of the subject can be found in [28].

متن کامل

Tolerances in Geometric Constraint Problems

We study error propagation through implicit geometric problems by linearizing and estimating the linearization error. The method is particularly useful for quadratic constraints, which turns out to be no big restriction for many geometric problems in applications.

متن کامل

Geometric Problems in Machine Learning

We present some problems with geometric characterizations that arise naturally in practical applications of machine learning. Our motivation comes from a well known machine learning problem, the problem of computing decision trees. Typically one is given a dataset of positive and negative points, and has to compute a decision tree that ts it. The points are in a low dimensional space, and the d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Series: Engineering science and architecture

سال: 2021

ISSN: 2522-1809,2522-1817

DOI: 10.33042/2522-1809-2021-1-161-58-68